翻訳と辞書 Words near each other ・ Read Township ・ Read Township, Butler County, Nebraska ・ Read Township, Clayton County, Iowa ・ Read Yourself Raw ・ Read's Cavern ・ Read's Department Stores ・ Read's Drug Store ・ Read's Island ・ Read, Lancashire ・ Read, West Virginia ・ Read, Write, & Type! ・ Read-copy-update ・ Read-modify-write ・ Read-only ・ Read-only memory ・ Read-only right moving Turing machines ・ Read-only Turing machine ・ Read-through ・ Read-write memory ・ Read. (Dubai) ・ Read/write ・ Readability ・ Readability survey ・ Readability test ・ Readable ・ Readahead ・ Readalong ・ Readbourne ・ ReadCube ・ Readdle Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Read-only right moving Turing machines ： ウィキペディア英語版 Read-only right moving Turing machines Read-only right moving Turing machines are a particular type of Turing machine. == Definition == The definition based on a single infinite tape defined to be a 7-tuple $M=\; \backslash langle\; Q,\; \backslash Gamma,\; b,\; \backslash Sigma,\; \backslash delta,\; q\_0,\; F\; \backslash rangle$ where * $Q$ is a finite set of ''states'' * $\backslash Gamma$ is a finite set of the ''tape alphabet/symbols'' * $b\; \backslash in\; \backslash Gamma$ is the ''blank symbol'' (the only symbol allowed to occur on the tape infinitely often at any step during the computation) * $\backslash Sigma$, a subset of $\backslash Gamma$ not including b is the set of ''input symbols'' * $\backslash delta:\; Q\; \backslash times\; \backslash Gamma\; \backslash rightarrow\; Q\; \backslash times\; \backslash Gamma\; \backslash times\; \backslash$ is a function called the ''transition function'', R is a right movement (a right shift). * $q\_0\; \backslash in\; Q$ is the ''initial state'' * $F\; \backslash subseteq\; Q$ is the set of ''final'' or ''accepting states'' In the case of these types of Turing Machines, the only movement is to the right. There must exist at least one element of the set $F$ (a HALT state) for the machine to accept a regular language (Not in including the empty language). An example Read Only right moving Turing machine :Q = :Γ = :b = 0 = "blank" :Σ = $\backslash varnothing$, empty set :δ = see state-table below :q0 = A = initial state :F = the one element set of final states State table for 3 state, 2 symbol read only machine: 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Read-only right moving Turing machines」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.